Characterizations of Consistent Marked Graphs
نویسندگان
چکیده
A marked graph is a graph with a + or − sign on each vertex and is called consistent if each cycle has an even number of − signs. This concept is motivated by problems of communication networks and social networks. We present some new characterizations/recognition algorithms for consistent marked graphs.
منابع مشابه
Balanced group-labeled graphs
A group-labeled graph is a graph whose vertices and edges have been assigned labels from some abelian group. The weight of a subgraph of a group-labeled graph is the sum of the labels of the vertices and edges in the subgraph. A group-labeled graph is said to be balanced if the weight of every cycle in the graph is zero. We give a characterization of balanced group-labeled graphs that generaliz...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملOn characterizations of weakly $e$-irresolute functions
The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.
متن کاملErgodicity and Throughput Bounds of Petri Nets with Unique Consistent Firing Count Vector
This paper addresses ergodicity and throughput bounds characterizations for a subclass of timed and stochas-tic Petri nets, interleaving qualitative and quantitative theories. The considered nets represent an extension of the well known subclass of marked graphs, deened as having a unique consistent ring count vector, independently of the stochastic interpretation of the net model. In particula...
متن کاملMaxclique and unit disk characterizations of strongly chordal graphs
Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 127 شماره
صفحات -
تاریخ انتشار 2003